Effects of dynamical phases in Shor’s factoring algorithm with operational delays
نویسندگان
چکیده
L. F. Wei, Xiao Li, Xuedong Hu, and Franco Nori* Frontier Research System, The Institute of Physical and Chemical Research (RIKEN), Wako-shi, Saitama, 351-0198, Japan Institute of Quantum Optics and Quantum Information, Department of Physics, Shanghai Jiaotong University, Shanghai 200030, China Department of Physics, Shanghai Jiaotong University, Shanghai 200030, China Department of Physics, PMB 179, 104 Davey Laboratory, Penn State University, University Park, Pennsylvania 16802-6300, USA Department of Physics, University at Buffalo, SUNY, Buffalo New York 14260-1500, USA sReceived 5 May 2003; revised manuscript received 15 July 2004; published 22 February 2005d
منابع مشابه
Quantum computation and Shor’s factoring algorithm
Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for factoring whole numbers, which uses characteristically quantum effects. The algorithm illustrates ...
متن کاملQuantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers
In this paper we generalize the quantum algorithm for computing short discrete logarithms previously introduced by Eker̊a [2] so as to allow for various tradeoffs between the number of times that the algorithm need be executed on the one hand, and the complexity of the algorithm and the requirements it imposes on the quantum computer on the other hand. Furthermore, we describe applications of al...
متن کاملQuantum algorithms for computing short discrete logarithms and factoring RSA integers
In this paper we generalize the quantum algorithm for computing short discrete logarithms previously introduced by Eker̊a [2] so as to allow for various tradeoffs between the number of times that the algorithm need be executed on the one hand, and the complexity of the algorithm and the requirements it imposes on the quantum computer on the other hand. Furthermore, we describe applications of al...
متن کامل1 Ju n 20 04 A precise estimation of the computational complexity in Shor ’ s factoring algorithm
Abstract. A precise estimation of the computational complexity in Shor’s factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two prime numbers, is derived by the results related to number theory. Compared with Shor’s original estimation, our estimation shows that one can obtain the solution under such a condition, by less computation...
متن کاملFaster Quantum Number Factoring via Circuit Synthesis
A major obstacle to implementing Shor’s quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor’s algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005